Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-systemM of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-systemM′ of restarting automata of the same type asM that, working in the new mode ed, accep...

On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One

It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, the CD-system itself is not, as in each of its computations, the initial component and the successor ...

Relations and Transductions Realized by Restarting Automata

In the present thesis we introduce several ways of extending restarting automata to devices for realizing binary (word) relations, which is mainly motivated by linguistics. In particular, we adapt the notion of input/output-relations and proper-relations to restarting automata and to parallel communicating systems of two restarting automata (PC-systems). Further, we introduce a new model, calle...

Restarting automata with restricted utilization of auxiliary symbols

The restarting automaton is a restricted model of computation that was introduced by Jančar et al. to model the so-called analysis by reduction, which is a technique used in linguistics to analyze sentences of natural languages. The most general models of restarting automata make use of auxiliary symbols in their rewrite operations, although this ability does not directly correspond to any aspe...

CD-Systems of Restarting Automata